On Steiner Loops of cardinality 20

نویسنده

  • M. H. Armanious
چکیده

It is well known that there are five classes of sloops of cardinality 16 " SL(16)s" according to the number of sub-SL(8)s [4, 6]. In this article, we will show that there are exactly 8 classes of nonsimple sloops and 6 classes of simple sloops of cardinality 20 "SL(20)s". Based on the cardinality and the number of (normal) subsloops of SL(20), we will construct in section 3 all possible classes of nonsimple SL(20)s and in section 4 all possible classes of simple SL(20)s. We exhibit the algebraic and combinatoric properties of SL(20)s to distinguish each class. So we may say that there are six classes of SL(20)s having one sub-SL(10) and n subSL(8)s for n = 0, 1, 2, 3, 4 or 6. All these sloops are subdirectly irreducible having exactly one proper homomorphic image isomorphic to SL(2). For n = 0, the associated SL(20) is a nonsimple subdirectly irreducible having one sub-SL(10) and no sub-SL(8)s. Indeed, the associated Steiner quasigroup SQ(19) of this case supplies us with a new example for a semiplanar SQ(19), where the smallest well-known example of semi-planar squags is of cardinality 21 " cf. [3]". It is well known that there is a class of planar Steiner triple systems (STS(19)s) due to Doyen [7], where the associated planar SL(20) has no sub-SL(10) and no sub-SL(8). In section 4 we will show that there are other 6 classes of simple SL(20)s having n sub-SL(8)s for n = 0, 1, 2, 3, 4, 6, but no sub-SL(10)s. It is well-known that a sub-SL(m) of an SL(2m) is normal. In the last theorem of this section, we give a necessary and sufficient condition for a sub-SL(2) to be normal of an SL(2m). Accordingly, we have shown that if a sloop SL(20) has a sub-SL(10) and 12 sub-SL(8), then this sloop is isomorphic to the direct product SL(10) × SL(2) and if a sloop SL(20) has 12 sub-SL(8)s and no sub-SL(10), then this sloop is a subdirectly irreducible having exactly one proper homomorphic image isomorphic to SL(10). In section 5, we describe how can one construct an example for each class of smiple and of nonsimple SL(20)s.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Subdirectly Irreducible Steiner Loops of Cardinality 2n

Let L1 be a finite simple sloop of cardinality n or the 8-element sloop. In this paper, we construct a subdirectly irreducible (monolithic) sloop L = 2⊗αL1 of cardinality 2n, for each n ≥ 8, with n ≡ 2 or 4 (mod 6), in which each proper homomorphic image is a Boolean sloop. Quackenbush [12] has proved that the variety V (L1) generated by a finite simple planar sloop L1 covers the smallest nontr...

متن کامل

The forcing Steiner number of a graph

For a connected graph G = (V,E), a set W ⊆ V is called a Steiner set of G if every vertex of G is contained in a Steiner W -tree of G. The Steiner number s(G) of G is the minimum cardinality of its Steiner sets and any Steiner set of cardinality s(G) is a minimum Steiner set of G. For a minimum Steiner set W of G, a subset T ⊆ W is called a forcing subset for W if W is the unique minimum Steine...

متن کامل

On the forcing geodetic and forcing Steiner numbers of a graph

For a connected graph G = (V,E), a set W ⊆ V is called a Steiner set of G if every vertex of G is contained in a Steiner W -tree of G. The Steiner number s(G) of G is the minimum cardinality of its Steiner sets and any Steiner set of cardinality s(G) is a minimum Steiner set of G. For a minimum Steiner set W of G, a subset T ⊆ W is called a forcing subset for W if W is the unique minimum Steine...

متن کامل

On Steiner Domination Number of Graphs

For a connected graph G, a set of vertices W in G is called a Steiner dominating set if W is both a Steiner set and a dominating set. The minimum cardinality of a Steiner dominating set of G is its Steiner domination numberand is denoted by ) (G s  . In this paper, it is studied that how the Steiner domination number is affected by adding a single edge to paths, complete graphs, cycles, star a...

متن کامل

Semi-planar Steiner quasigroups of cardinality 3n

It is well known that for each n ≡ 1 or 3 (mod 6) there is a planar Steiner quasigroup (briefly, squag) of cardinality n (Doyen (1969) and Quackenbush (1976)). A simple squag is semi-planar if every triangle either generates the whole squag or the 9-element subsquag (Quackenbush (1976)). In fact, Quakenbush has stated that there should be such semi-planar squags. In this paper, we construct a s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014